Fault Identification using end-to-end data by imperialist competitive algorithm
Authors
Abstract:
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive algorithm using passive techniques to localize faults in computer networks. The presented approach using end-to-end data detect that there are faults on the network, and then we use imperialist competitive algorithm (ICA) to localize faults on the network. The aim of proposed approach is to minimize the cost of localization of faults in the network. According to simulation results, our algorithm is better than other state-of-the-art approaches that localize and repair all faults in a network.
similar resources
fault identification using end-to-end data by imperialist competitive algorithm
faults in computer networks may result in millions of dollars in cost. faults in a network need to be localized and repaired to keep the health of the network. fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. in this paper, we propose a novel approach based on imperialist competitive alg...
full textSTRUCTURAL DAMAGE PROGNOSIS BY EVALUATING MODAL DATA ORTHOGONALITY USING CHAOTIC IMPERIALIST COMPETITIVE ALGORITHM
Presenting structural damage detection problem as an inverse model-updating approach is one of the well-known methods which can reach to informative features of damages. This paper proposes a model-based method for fault prognosis in engineering structures. A new damage-sensitive cost function is suggested by employing the main concepts of the Modal Assurance Criterion (MAC) on the first severa...
full textOptimization of Fabric Layout by Using Imperialist Competitive Algorithm
In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...
full textSOLVING BLASIUS EQUATION USING IMPERIALIST COMPETITIVE ALGORITHM
In this study, a new approach isintroduced to solve Blasius differential equation using of ImperialistCompetitive Algorithm (ICA). This algorithm is inspired by competitionmechanism among Imperialists and colonies and has demonstrated excellent capabilitiessuch as simplicity, accuracy, faster convergence and better global optimumachievement in contrast to other evolutionary algorithms. The obta...
full textOPTIMIZATION TO IDENTIFY MUSKINGUM MODEL PARAMETERS USING IMPERIALIST COMPETITIVE ALGORITHM
In engineering, flood routing is an important technique necessary for the solution of a floodcontrol problem and for the satisfactory operation of a flood-prediction service. A simple conceptual model like the Muskingum model is very effective for the flood routing process. One challenge in application of the Muskingum model is that its parameters cannot be measured physically. In this article ...
full textMy Resources
Journal title
volume 4 issue 1
pages 404- 410
publication date 2015-02-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023